Self-Converse Tournaments
نویسندگان
چکیده
منابع مشابه
Self-Selection and the Efficiency of Tournaments
Self-Selection and the Efficiency of Tournaments When exogenously imposed, rank-order tournaments have incentive properties but their overall efficiency is reduced by a high variance in performance (Bull, Schotter, and Weigelt 1987). However, since the efficiency of performance-related pay is attributable both to its incentive effect and to its selection effect among employees (Lazear, 2000), i...
متن کاملTransitive tournaments and self-complementary graphs
A simple proof is given for a result of Sali and Simonyi on selfcomplementary graphs. ß 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111±112, 2001 Keywords: self-complementary graphs; transitive tournaments Motivated by Sperner capacities of digraphs, A. Sali and G. Simonyi [1] discovered an interesting property of self-complementary graphs. Here a proof of their result is given which is con...
متن کاملEliminating "Converse" from Converse PDL
In this paper we show that it is possible to eliminate the converse operator from the propositional dynamic logic CPDL Converse PDL without compromising the soundness and completeness of inference for it Speci cally we present an encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula but adds enough information so as not to destroy its original meaning with...
متن کاملSelf-converse Mendelsohn designs with block size 6q
A Mendelsohn design lv! D( v, k, A) is a pair (X, B) where X is a v-set together with a collection B of cyclic k-tuples from X such that each ordered pair from X is contained in exactly A cyclic k-tuples of B. An M D(v, k, A) is said to be self-converse, denoted by SC1\ID(v,k,A) = (X,B,f), if there is an isomorphism f from (X, B) to (X, B-1), where B1 = {(:Ek,:r:k-l, ""X2,Xl!: (:1:1, ""Xk! E B}...
متن کاملSelf-converse Mendelsohn designs with odd block size
A Mendelsohn design .M D(v, k,).) is a pair (X, B), where X is a vset together with a collection B of ordered k-tuples from X such that each ordered pair from X is contained in exactly ). k-tuples of B. An M D(v, k,).) is said to be self-converse, denoted by SC!'vf D( v, k,).) = (X,B,/), if there is an isomorphism / from (X, B) to (X,B), where B-1 {(Xk,:r:k-l, ... ,X2,Xl); (Xl,,,,,Xk) E B}. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 1979
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-1979-004-6